Small Integral Trees
نویسنده
چکیده
We give a table with all integral trees on at most 50 vertices, and characterize integral trees with a single eigenvalue 0.
منابع مشابه
Matching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملIntegral trees of diameter 4
An integral tree is a tree whose adjacency matrix has only integer eigenvalues. While most previous work by other authors has been focused either on the very restricted case of balanced trees or on finding trees with diameter as large as possible, we study integral trees of diameter 4. In particular, we characterize all diameter 4 integral trees of the form T (m1, t1) • T (m2, t2). In addition ...
متن کاملIntegral trees with diameters 4, 6 and 8
In this paper, some new families of integral trees with diameters 4, 6 and 8 are given. All these classes are infinite. They are different from those in the existing literature. We also prove that the problem of finding integral trees of diameters 4, 6 and 8 is equivalent to the problem of solving Pell’s diophantine equations. The discovery of these integral trees is a new contribution to the s...
متن کاملIntegral trees with diameters 5 and 6
In this paper, some new families of integral trees with diameters 5 and 6 are constructed. All these classes are infinite. They are different from those in the existing literature. We also prove that the problem of finding integral trees of diameters 5 and 6 is equivalent to the problem of solving some Diophantine equations. The discovery of these integral trees is a new contribution to the sea...
متن کاملIntegral trees of odd diameters
A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. Recently, Csikvári proved the existence of integral trees of any even diameter. In the odd case, integral trees have been constructed with diameter at most 7. In this paper, we show that for every odd integer n > 1, there are infinitely many integral trees of diameter n. AMS Mathematics Subject C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 15 شماره
صفحات -
تاریخ انتشار 2008